A Parallel Hyper-heuristic Approach for the Two-dimensional Rectangular Strip-packing Problem
نویسندگان
چکیده
منابع مشابه
A Parallel Hyper-heuristic Approach for the Two-dimensional Rectangular Strip-packing Problem
In this paper, we present a parallel hyper-heuristic approach for two-dimensional rectangular strip-packing problems (2DSP). This is an island model with a special master-slave structure, and in all the islands we run a memetic algorithm-based hyper-heuristic (HH). The basic technique of this HH is a memory-based evolutionary technique, the “extended virtual loser” (EVL). The memory-based techn...
متن کاملA Meta-heuristic Algorithm for the Strip Rectangular Packing Problem
A new meta-heuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter...
متن کاملA Genetic Programming Hyper-Heuristic Approach for Evolving Two Dimensional Strip Packing Heuristics
We present a genetic programming system to evolve reusable heuristics for the two dimensional strip packing problem. The evolved heuristics are constructive, and decide both which piece to pack next and where to place that piece, given the current partial solution. This work contributes to a growing research area which represents a paradigm shift in search methodologies. Instead of using evolut...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملOne-dimensional heuristics adapted for two-dimensional rectangular strip packing
We consider two-dimensional rectangular strip packing without rotation of items and without the guillotine cutting constraint. We propose a single-pass heuristic which fills every free space in a onedimensional knapsack fashion, i.e. considering only item widths. It appears especially important to assign suitable heuristic “pseudo-values” as profits in this knapsack problem. This simple heurist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2015
ISSN: 1330-1136,1846-3908
DOI: 10.2498/cit.1002422